Preserving consistency in geometric modeling with graph transformations

نویسندگان

چکیده

Abstract Labeled graphs are particularly well adapted to represent objects in the context of topology-based geometric modeling. Thus, graph transformation theory is used implement modeling operations and check their consistency. This article defines a class rules dedicated embedding computations. Objects here defined as particular subclass labeled which arc labels encode topological structure (i.e., cell subdivision: vertex, edge, face) node relevant data: vertex positions, face colors, volume density). Object consistency by labeling constraints must be preserved that modify topology and/or embedding. Dedicated variables allow us access existing from underlying (e.g., collecting all points order compute new using user-provided functions barycenter several points). To ensure safety operations, we provide syntactic conditions on preserve object constraints.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling with Graph Transformations

In this paper we give a general overview of graph grammars and graph transformation as important modeling techniques for several areas in computer science. In particular we present the main ideas of the algebraic approach, which is the basis for a categorical theory of rule-based transformations of high-level structures. 1 General Overview of Graph Transformation The research area of graph gram...

متن کامل

Consistency-Preserving Model Evolution through Transformations

With model-based development being on the verge of becoming an industrial standard, the topic of research of statically checking the consistency of a model made up of several submodels has already received increasing attention. The evolution of models within software engineering requires support for incremental consistency analysis techniques of a new version of the model after evolution, there...

متن کامل

Graph transformations preserving the stability number

We analyse the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin deletions. We also show how some of these transformations are related to the notion of even pair introduced to color some classes of perfect gr...

متن کامل

Improved Graph Laplacian via Geometric Self-Consistency

We address the problem of setting the kernel bandwidth used by Manifold Learning algorithms to construct the graph Laplacian. Exploiting the connection between manifold geometry, represented by the Riemannian metric, and the Laplace-Beltrami operator, we set by optimizing the Laplacian’s ability to preserve the geometry of the data. Experiments show that this principled approach is effective an...

متن کامل

Some Observations on Dirac Measure-Preserving Transformations and their Results

Dirac measure is an important measure in many related branches to mathematics. The current paper characterizes measure-preserving transformations between two Dirac measure spaces or a Dirac measure space and a probability measure space. Also, it studies isomorphic Dirac measure spaces, equivalence Dirac measure algebras, and conjugate of Dirac measure spaces. The equivalence classes of a Dirac ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Structures in Computer Science

سال: 2022

ISSN: ['1469-8072', '0960-1295']

DOI: https://doi.org/10.1017/s0960129522000226